Cutting lemma and union lemma for the domination game

Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars

The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008 Kanazawa proved an analogue of pumping lemma for well-nested multiplecontext free languages. However, the statement of lemma is too weak for practical usage. We prove a stronger variant of pumping lemma and an analogue of Ogden lemma for the class of tree-adjoining language...

Cutting lemma and Zarankiewicz's problem in distal structures

We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in ominimal expansions of fields. Using it, we generalize the results in [10] on the semialgebraic planar Zarankiewicz problem to arbitrary o-minimal structures, in particular obtaining an o-minimal generalizatio...

Lecture 19 : The Vanishing Lemma and Lemma 8 . 8

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

Siegel’s Lemma Outside of a Union of Varieties

Recommended Citation Fukshansky, Lenny. "Siegel's lemma outside of a union of varieties.